A SEQUENTIAL ALLOCATION PROBLEM WITH TWO KINDS OF TARGETS
نویسندگان
چکیده
منابع مشابه
Gaze-shift dynamics in two kinds of sequential looking tasks
Gaze-shift dynamics of unrestrained seated subjects were examined. The subjects participated in two tasks. In the first task, they tapped sequences of 3-D targets located on a table in front of them. In the second task, they only looked at similar sequences of targets. The purpose of the task (tapping vs only looking) affected the dynamics of gaze-shifts. Gaze and eye-in-head peak velocities we...
متن کاملRedundancy Allocation Problem of a System with Three-state Components: A Genetic Algorithm (RESEARCH NOTE)
The redundancy allocation is one of the most important and useful problems in system optimization, especially in electrical and mechanical systems. The object of this problem is to maximize system reliability or availability within a minimum operation cost. Many works have been proposed in this area so far to draw the problem near to real-world situations. While in classic models the system com...
متن کاملA redundancy allocation problem with the choice of redundancy strategies by a memetic algorithm
This paper proposes an efficient algorithm based on memetic algorithm (MA) for a redundancy allocation problem without component mixing (RAPCM) in a series-parallel system when the redundancy strategy can be chosen for individual subsystems. Majority of the solution methods for the general RAPCM assume that the type of a redundancy strategy for each subsystem is pre-determined and known a prior...
متن کاملSequential Allocation With Minimal
This paper describes algorithms for the design of sequential experiments where extensive switching is undesirable. Given an objective function to minimize by sampling between Bernoulli populations, two diierent models are considered. The constraint model optimizes the tradeoo of the maximum number of switches vs. the objective function, while the cost model optimizes the tradeoo for the expecte...
متن کاملManipulations in Two-Agent Sequential Allocation with Random Sequences
Sequential allocation is one of the most fundamental models for allocating indivisible items to agents in a decentralized manner, in which agents sequentially pick their favorite items among the remainder based on a pre-defined priority ordering of agents (a sequence). In recent years, algorithmic issues about agents’ manipulations have also been investigated, such as the computational complexi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1979
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.22.16